Minimizing Effective Dimension using Linear Transformation

نویسندگان

  • Junichi Imai
  • Ken Seng Tan
چکیده

In recent years, constructions based on Brownian bridge [11], principal component analysis[1], and linear transformation [7] have been proposed in the context of derivative pricing to further enhance QMC through dimension reduction. Motivated by [16, 18] and the ANOVA decomposition, this paper (i) formally justifies the dimension minimizing algorithm of Tan and Imai [7], and (ii) proposes a new formulation of linear transformation which explicitly reduces the effective dimension (in the truncation sense) of a function. Another new application of LT method to an interest rate model is considered. We establish the situation for which linear transformation method outperforms PCA. This method is not only effective on dimension reduction, it is also robust and can easily be extended to general diffusion processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi soliton solutions, bilinear Backlund transformation and Lax pair of nonlinear evolution equation in (2+1)-dimension

As an application of Hirota bilinear method, perturbation expansion truncated at different levels is used to obtain exact soliton solutions to (2+1)-dimensional nonlinear evolution equation in much simpler way in comparison to other existing methods. We have derived bilinear form of nonlinear evolution equation and using this bilinear form, bilinear Backlund transformations and construction of ...

متن کامل

Feature Selection through Minimization of the VC dimension

Feature selection involes identifying the most relevant subset of input features, with a view to improving generalization of predictive models by reducing overfitting. Directly searching for the most relevant combination of attributes is NP-hard. Variable selection is of critical importance in many applications, such as micro-array data analysis, where selecting a small number of discriminative...

متن کامل

Solving non-linear Horn clauses using a linear solver

Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The pro...

متن کامل

Implementing quasi-Monte Carlo simulations with linear transformations

Pricing exotic multi-asset path-dependent options requires extensive Monte Carlo simulations. In the recent years the interest to the Quasi-monte Carlo technique has been renewed and several results have been proposed in order to improve its efficiency with the notion of effective dimension. To this aim, Imai and Tan introduced a general variance reduction technique in order to minimize the nom...

متن کامل

An Abstract of the Thesis of Title: on Error Bounds for Linear Feature Extraction. on Error Bounds for Linear Feature Extraction

approved: Raviv Raich Linear transformation for dimension reduction is a well established problem in the field of machine learning. Due to the numerous observability of parameters and data, processing of the data in its raw form is computationally complex and difficult to visualize. Dimension reduction by means of feature extraction offers a strong preprocessing step to reduce the complexity of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005